#include <bits/stdc++.h>
using namespace std;

double eq[110][110];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int n, i, j, k, now;
	cin >> n;
	for (i = 1; i <= n; ++i)
	{
		for (j = 1; j <= n + 1; ++j)
		{
			cin >> eq[i][j];
		}
	}
	for (i = 1; i <= n; ++i)
	{
		now = i;
		for (j = i + 1; j <= n; ++j)
		{
			if (abs(eq[j][i]) > abs(eq[now][i]))
			{
				now = j;
			}
		}
		swap(eq[now], eq[i]);
		if (eq[i][i] == 0)
		{
			cout << "No Solution" << endl;
			return 0;
		}
		for (j = n + 1; j >= i; --j) // 将eq[i][i]化为1，其他的系数也要调整。倒着弄是为了防止先把eq[i][i]给改了，便于简化代码
		{
			eq[i][j] /= eq[i][i];
		}
		for (j = i + 1; j <= n; ++j)
		{
			for (k = i + 1; k <= n + 1; ++k)
			{
				eq[j][k] -= eq[j][i] * eq[i][k];
			}
			eq[j][i] = 0;
		}
	}
	for (i = n; i >= 1; --i)
	{
		for (j = i + 1; j <= n; ++j)
		{
			eq[i][n + 1] -= eq[i][j] * eq[j][n + 1];
			eq[i][j] = 0;
		}
		eq[i][n + 1] /= eq[i][i];
		eq[i][i] = 1;
	}
	for (i = 1; i <= n; ++i)
	{
		cout << fixed << setprecision(2) << eq[i][n + 1] << '\n';
	}
	return 0;
}
